Simple atomic snapshots: A linear complexity solution with unbounded time-stamps
Identifieur interne : 002A70 ( Main/Exploration ); précédent : 002A69; suivant : 002A71Simple atomic snapshots: A linear complexity solution with unbounded time-stamps
Auteurs : Lefteris M. Kirousis [Grèce] ; Paul Spirakis [Grèce] ; Philippas Tsigas [Allemagne]Source :
- Information Processing Letters [ 0020-0190 ] ; 1994.
Abstract
Let X1,…,Xc be variables which together constitute a composite register. These variables are shared by a number of processes which operate in a totally asynchronous and wait-free manner. An operation by a process on the composite register is either a write to one of the variables or a read of the values of all variables. All operations are required to be atomic, i.e. an execution of any number of them (including reads) must be linearizable, in a way consistent with the values returned by the reads. In a single reader composite register no two reads can concurrently access the composite register. We give a new protocol implementing a single reader composite register for the case when there is a single writer per variable. Our construction uses time-stamps that may take values as large as the number of operations performed. The advantages of our construction over previous (bounded time-stamps) solutions are: 1. (i) Both the protocol and its formal correctness proof are easy to understand. 2. (ii) The time complexity of an operation of our construction (i.e. the number of its sub-operations) and the number of the subregisters used in our construction are at most equal to the number of processes that can concurrently access the composite register.
Url:
DOI: 10.1016/0020-0190(95)00198-0
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 001B81
- to stream Istex, to step Curation: 001B81
- to stream Istex, to step Checkpoint: 000E10
- to stream Main, to step Merge: 002B94
- to stream Main, to step Curation: 002A70
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title>Simple atomic snapshots: A linear complexity solution with unbounded time-stamps</title><author><name sortKey="Kirousis, Lefteris M" sort="Kirousis, Lefteris M" uniqKey="Kirousis L" first="Lefteris M." last="Kirousis">Lefteris M. Kirousis</name></author><author><name sortKey="Spirakis, Paul" sort="Spirakis, Paul" uniqKey="Spirakis P" first="Paul" last="Spirakis">Paul Spirakis</name></author><author><name sortKey="Tsigas, Philippas" sort="Tsigas, Philippas" uniqKey="Tsigas P" first="Philippas" last="Tsigas">Philippas Tsigas</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:E8496D9858717408824F3061E9671A63AFC5B1A8</idno><date when="1996" year="1996">1996</date><idno type="doi">10.1016/0020-0190(95)00198-0</idno><idno type="url">https://api.istex.fr/document/E8496D9858717408824F3061E9671A63AFC5B1A8/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">001B81</idno><idno type="wicri:Area/Istex/Curation">001B81</idno><idno type="wicri:Area/Istex/Checkpoint">000E10</idno><idno type="wicri:doubleKey">0020-0190:1996:Kirousis L:simple:atomic:snapshots</idno><idno type="wicri:Area/Main/Merge">002B94</idno><idno type="wicri:Area/Main/Curation">002A70</idno><idno type="wicri:Area/Main/Exploration">002A70</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a">Simple atomic snapshots: A linear complexity solution with unbounded time-stamps</title><author><name sortKey="Kirousis, Lefteris M" sort="Kirousis, Lefteris M" uniqKey="Kirousis L" first="Lefteris M." last="Kirousis">Lefteris M. Kirousis</name><affiliation wicri:level="1"><country xml:lang="fr">Grèce</country><wicri:regionArea>Department of Computer Engineering and Informatics, University of Patras, Rio, 265 00 Patras</wicri:regionArea><wicri:noRegion>265 00 Patras</wicri:noRegion></affiliation></author><author><name sortKey="Spirakis, Paul" sort="Spirakis, Paul" uniqKey="Spirakis P" first="Paul" last="Spirakis">Paul Spirakis</name><affiliation wicri:level="1"><country xml:lang="fr">Grèce</country><wicri:regionArea>Department of Computer Engineering and Informatics, University of Patras, Rio, 265 00 Patras</wicri:regionArea><wicri:noRegion>265 00 Patras</wicri:noRegion></affiliation></author><author><name sortKey="Tsigas, Philippas" sort="Tsigas, Philippas" uniqKey="Tsigas P" first="Philippas" last="Tsigas">Philippas Tsigas</name><affiliation wicri:level="3"><country xml:lang="fr">Allemagne</country><wicri:regionArea>MPI für Informatik, Im Stadtwald, 66123 Saarbrücken</wicri:regionArea><placeName><region type="land" nuts="2">Sarre (Land)</region><settlement type="city">Sarrebruck</settlement></placeName></affiliation></author></analytic><monogr></monogr><series><title level="j">Information Processing Letters</title><title level="j" type="abbrev">IPL</title><idno type="ISSN">0020-0190</idno><imprint><publisher>ELSEVIER</publisher><date type="published" when="1994">1994</date><biblScope unit="volume">58</biblScope><biblScope unit="issue">1</biblScope><biblScope unit="page" from="47">47</biblScope><biblScope unit="page" to="53">53</biblScope></imprint><idno type="ISSN">0020-0190</idno></series><idno type="istex">E8496D9858717408824F3061E9671A63AFC5B1A8</idno><idno type="DOI">10.1016/0020-0190(95)00198-0</idno><idno type="PII">0020-0190(95)00198-0</idno></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0020-0190</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Let X1,…,Xc be variables which together constitute a composite register. These variables are shared by a number of processes which operate in a totally asynchronous and wait-free manner. An operation by a process on the composite register is either a write to one of the variables or a read of the values of all variables. All operations are required to be atomic, i.e. an execution of any number of them (including reads) must be linearizable, in a way consistent with the values returned by the reads. In a single reader composite register no two reads can concurrently access the composite register. We give a new protocol implementing a single reader composite register for the case when there is a single writer per variable. Our construction uses time-stamps that may take values as large as the number of operations performed. The advantages of our construction over previous (bounded time-stamps) solutions are: 1. (i) Both the protocol and its formal correctness proof are easy to understand. 2. (ii) The time complexity of an operation of our construction (i.e. the number of its sub-operations) and the number of the subregisters used in our construction are at most equal to the number of processes that can concurrently access the composite register.</div></front></TEI><affiliations><list><country><li>Allemagne</li><li>Grèce</li></country><region><li>Sarre (Land)</li></region><settlement><li>Sarrebruck</li></settlement></list><tree><country name="Grèce"><noRegion><name sortKey="Kirousis, Lefteris M" sort="Kirousis, Lefteris M" uniqKey="Kirousis L" first="Lefteris M." last="Kirousis">Lefteris M. Kirousis</name></noRegion><name sortKey="Spirakis, Paul" sort="Spirakis, Paul" uniqKey="Spirakis P" first="Paul" last="Spirakis">Paul Spirakis</name></country><country name="Allemagne"><region name="Sarre (Land)"><name sortKey="Tsigas, Philippas" sort="Tsigas, Philippas" uniqKey="Tsigas P" first="Philippas" last="Tsigas">Philippas Tsigas</name></region></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Musique/explor/OperaV1/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 002A70 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 002A70 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Musique
|area= OperaV1
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:E8496D9858717408824F3061E9671A63AFC5B1A8
|texte= Simple atomic snapshots: A linear complexity solution with unbounded time-stamps
}}
| This area was generated with Dilib version V0.6.21. |  |